Intersection numbers in the curve graph with a uniform constant
نویسندگان
چکیده
منابع مشابه
Intersection numbers in the curve graph with a uniform constant
We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting of geodesics. Furthermore, the method gives inequalities with a uniform constant depending only on the topology of the surface.
متن کاملConnectivity of the uniform random intersection graph
A uniform random intersection graph G(n,m, k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels. These graphs arise in the study of the security of wireless sensor networks, in particular when m...
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملIntersection numbers and the hyperbolicity of the curve complex
In [MM1], Masur and Minsky showed that the curve complex associated to a surface is hyperbolic in the sense of Gromov. In this paper we give another proof of this result. Our constructions are more combinatorial in nature, and allow for certain refinements and elaborations. The result applies to a compact surface, possibly with boundary (apart from a few trivial cases), or equivalently to a clo...
متن کاملPlanarity of Intersection Graph of submodules of a Module
Let $R$ be a commutative ring with identity and $M$ be an unitary $R$-module. The intersection graph of an $R$-module $M$, denoted by $Gamma(M)$, is a simple graph whose vertices are all non-trivial submodules of $M$ and two distinct vertices $N_1$ and $N_2$ are adjacent if and only if $N_1cap N_2neq 0$. In this article, we investigate the concept of a planar intersection graph and maximal subm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2016
ISSN: 0166-8641
DOI: 10.1016/j.topol.2016.03.009